Power system restoration in distribution network using minimum spanning tree - Kruskal’s algorithm
نویسندگان
چکیده
منابع مشابه
fault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Parallel Minimum Spanning Tree Algorithm
The Minimal Spanning Tree (MST) problem is a classical graph problem which has many applications in various areas. In this paper we discuss a concurrent MST algorithm derived from Prim’s algorithm presented by Setia et al. in 2009, targeting symmetric multiprocessing (SMP) with a shared address space. The pseudocode of the algorithm is presented, combined with three interesting heuristics in or...
متن کاملA Novel Sectionalizing Method for Power System Parallel Restoration Based on Minimum Spanning Tree
Parallel restoration is a way to accelerate the black-start procedure of power systems following a blackout. An efficient sectionalizing scheme can reduce the restoration time of a system, taking into account the black-start ability, generation-load balance of subsystems, restoration time of branches, start-up time of generating units, and effects of dispatchable loads and faulted devices. Solv...
متن کاملExact algorithm for delay-constrained capacitated minimum spanning tree network
The delay-constrained capacitated minimum spanning tree (DC-CMST) problem of finding several broadcast trees from a source node is discussed. While the traditional CMST problem deals with only the traffic capacity constraint served by a port of the source node, and delay-constrained minimum spanning tree (DCMST) considers only the maximum end–end delay constraint, the DC-CMST problem deals with...
متن کاملUncertain Distribution-Minimum Spanning Tree Problem
This paper investigates the minimum spanning tree problem in the framework of uncertainty theory, where the edge weights are assumed as uncertain variables. The concept of ideal uncertain minimum spanning tree is initiated by extending the definition of the uncertain α-minimum spanning tree. On the basis of this new concept, we propose the definition of uncertain distribution-minimum spanning t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science
سال: 2019
ISSN: 2502-4760,2502-4752
DOI: 10.11591/ijeecs.v16.i1.pp1-8